Equidistant codes with distance 12
نویسندگان
چکیده
منابع مشابه
Equidistant subspace codes
In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the cardinality of the ground field is large enough. More precisely, we prove that for most values of the parameters, an equidistant code of maximum cardinality is ei...
متن کاملEquidistant codes in the Grassmannian
Equidistant codes over vector spaces are considered. For k-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codeswhichmight produce the largest non-sunflower codes. A novel construction, based on the Plücker embedding, for 1-intersecting codes of k-dimensional subspaces over Fq , n ≥ k+1 2 , where the cod...
متن کاملOn Equidistant Constant Weight Codes
Equidistant constant weight codes are studied in this paper. The dual distance distribution of equidistant constant weight codes is investigated and used to obtain upper bounds on the size of such codes as well as equidistant codes in general. ? 2003 Elsevier Science B.V. All rights reserved.
متن کاملEquidistant Arithmetic Codes and Character Sums
A cyclic arithmetic code is a subgroup of Z/(rn − 1)Z, where the weight of a word x is the minimal number of nonzero coefficients in the representation x ≡ ∑n−1 i=0 cir with |ci| < r for all i. A code is called equidistant if all codewords have the same weight. In this paper necessary conditions for the existence of equidistant codes are given. By relating these conditions to character sums on ...
متن کاملAll q-ary equidistant 3-codes
The elements of {0, 1, . . . , q − 1} are called q-ary codewords of length n over a q-element alphabet. A code is a set of codewords. The Hammingdistance d(c1, c2) of two codewords c1 and c2 is the number of positions where they differ. A code C is called equidistant with distance d if the Hammingdistance of any two codewords is exactly d. Another, shorter name is: q-ary equidistant d-code. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90021-8